Calculating Balanced Incomplete Block Design for Educational Assessments
نویسندگان
چکیده
A popular design in large scale' educational assessments is the balanced incomplete block design. The design assumes that the item pool is split into a set of blocks of items that are assigned to assessment booklets. This paper shows how the technique of 0-1 linear programming can be used to calculate a balanced incomplete block design. Several structural as well as practical constraints on this type of design are formulated as linear (in)equalities. In addition, possible objective functions to optimize the design are discussed. The technique is demonstrated using an item pool from the 1996 Grade 8 Mathematics National Assessment of Educational Progress Project. (Contains 2 tables and 16 references.) (Author/SLD) Reproductions supplied by EDRS are the best that can be made from the original document. Calculating Balanced Incomplete Block Design for Educational Assessments Wim J. van der Linden, University of Twente James E. Carlson, CTB/McGraw-Hill faculty of N EDUCATIONAL SCIENCE AND TECHNOLOGY Department o Educational Research Report` 99-08 PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIAL HAS BEEN GRANTED BY
منابع مشابه
On the Type-1 Optimality of Nearly Balanced Incomplete Block Designs with Small Concurrence Range
The class of nearly balanced incomplete block designs with concurrence range l, or NBBD(l), is defined. This extends previous notions of “most balanced” designs to cover settings where off-diagonal entries of the concurrence matrix must differ by a positive integer l ≥ 2. Sufficient conditions are found for optimality of NBBD(2)’s under type-1 criteria, then used to establish Aand D-optimality ...
متن کاملStrongly Regular Graphs Arising From Balanced Incomplete Block Design With λ = 1
In [M. Klin, A. Munemusa, M. Muzychuk, P.-H. Zieschang Directed strongly regular graphs obtained from coherent algebras. Linear Algebra and its Applications 337, (2004) 83-109] the flag algebra of a given balanced incomplete block design with parameters (ν, b, r, k, λ) where λ = 1, has been constructed. In this paper, we consider the association scheme which is related to this flag algebra. By ...
متن کاملConstruction of Balanced Incomplete Block Designs Using Cyclic Shifts
The construction of balanced incomplete block designs is considered using the method of cyclic shifts. An interesting feature of this method is that there is no need to construct the bocks of the actual design to obtain the properties of a design. One can obtain the off-diagonal elements of the concurrence matrix from the sets of shifts with less effort. A catalogue of balanced incomplete block...
متن کاملBalanced incomplete block designs with block size~9: Part III
The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: λ(v − 1) ≡ 0 mod (k − 1) λv(v − 1) ≡ 0 mod k(k − 1) Earlier work has studied k = 9 with λ ∈ {1, 2, 3, 4, 6, 8, 9, 12}. In this article we show that the necessary conditions are sufficient for λ = 9 and every other λ not previously studied.
متن کاملRobustness of Nested Balanced Incomplete Block Designs Against Missing Data
Robustness aspects of nested balanced incomplete block designs against missing data have been investigated using connectedness and efficiency criteria. Sufficient condition for robustness of a design has been obtained for the loss of any m observations, using connectedness criterion. Designs robust against the loss of any m observations belonging to one sub-block, loss of any two observations b...
متن کامل